#include <iostream>
using namespace std;
struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode() : val(0), left(nullptr), right(nullptr) {}
	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
	TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

class Solution {
public:
	bool hasPathSum(TreeNode* root, int targetSum) {
		if(root == nullptr) return false;
		if(root->left == nullptr && root ->right==nullptr && targetSum == root->val) return true;
		if(root->left == nullptr && root ->right==nullptr && targetSum != root->val) return false;
		
		if(hasPathSum(root->left,targetSum - root->val)){
			return true;
		}
		if(hasPathSum(root->right,targetSum-root->val)){
			return true;
		}
		return false;
	}
};
class Solution {
private:
	int result;
	int maxDepth = INT_MIN;
	void traversal(TreeNode* node,int depth){
		if(node == nullptr) return;
		if(node->left == nullptr && node->right == nullptr){
			if(depth > maxDepth){
				maxDepth = depth;
				result = node->val;
			}
		}
		traversal(node->left,depth+1);
		traversal(node->right,depth+1);
	}
public:
	int findBottomLeftValue(TreeNode* root) {
		traversal(root,1);
		return result;
	}
};
int main(){
	
	return 0;
}
